GATE CSE 2019
Q31.
Consider the following four processes with arrival times (in milliseconds) and their length of CPU burst (in milliseconds) as shown below: These processes are run on a single processor using preemptive Shortest Remaining Time First scheduling algorithm. If the average waiting time of the processes is 1 millisecond, then the value of Z is __________.Q32.
Consider that 15 machines need to be connected in a LAN using 8-port Ethernet switches. Assume that these switches do not have any separate up link ports. The minimum number of switches needed is ___________.Q33.
Suppose that in an IP-over-Ethernet network, a machine X wishes to find the MAC address of another machine Y in its subnet. Which one of the following techniques can be used for this?Q34.
Consider the following snapshot of a system running n concurrent processes. Process i is holding X_i instances of a resource R, 1\leq i\leq n. Assume that all instances of R are currently in use. Further, for all i, process i can place a request for at most Y_i additional instances of R while holding the X_i instances it already has. Of the n processes, there are exactly two processes p and q such that Y_p=Y_q=0. Which one of the following conditions guarantees that no other process apart from p and q can complete execution?Q35.
Consider three 4-variable functions f_1,f_2 \; and \; f_3, which are expressed in sum-of-minterms f_1=\Sigma (0,2,5,8,14) f_2=\Sigma (2,3,6,8,14,15) f_3=\Sigma (2,7,11,14) For the following circuit with one AND gate and one XOR gate, the output function f can be expressed as:Q36.
What is the minimum number of 2-input NOR gates required to implement 4-variable function expressed in sum-of-minterms from as f = \Sigma (0, 2, 5, 7, 8, 10, 13, 15)? Assume that all the inputs and their complements are available. Answer ________ .Q38.
Consider a sequence of 14 elements: A = [-5, -10, 6, 3, -1, -2, 13, 4, -9, -1, 4, 12, -3, 0]. The subsequence sum S(i,j)=\sum_{k=i}^{j}A[k]. Determine the maximum of S(i,j), where 0 \leq i \leq j \lt 14. (Divide and conquer approach may be used). Answer:______Q39.
The index node (inode) of a Unix-like file system has 12 direct, one single-indirect and one double-indirect pointer The disk block size is 4 kB and the disk block addresses 32-bits long. The maximum possible file size is (rounded off to 1 decimal place) __________ GB.Q40.
Let G be an undirected complete graph on n vertices, where n\gt2. Then, the number of different Hamiltonian cycles in G is equal to